Application usage and auto maintenance driven migration of applications and their dependencies

ABSTRACT

Embodiments described herein relate to methods, systems, and non-transitory computer readable mediums storing instructions for creating and executing migration workflows to replicate or migrate data (collectively referred to herein as ‘migration’) from one device or set of devices to another device or set of devices (e.g., from one computing environment to another). The method of migration involves determining periods of time when the application has decreased use or idle time. This decreased use or idle time is used to determine the optimal time to perform a migration of the application. Based on the calculated migration time as well as the time it takes to load the application after migration, the maintenance planner can alert users and help insure a successful migration.

BACKGROUND

Computing devices often exist in environments that include many devices (e.g., servers, virtualization environments, storage devices, network devices, etc.). Such environments may, from time to time, in whole or in part, require being replicated (e.g., backed-up) and/or migrated (e.g., moved from one set of devices to another). Such replications and/or migrations often require large amounts of investigation, coordination, time, and manual steps to be performed by any number of system administrators.

SUMMARY

In general, embodiments described herein relate to a method for performing a migration. The method includes identifying relationships between applications and generating, based on the relationships, a relationship matrix. The method also identifies reduced use times for each of the applications. The method then organizes the applications based on the relationship matrix and identified reduced use times and performs the migration based on the organizing of the applications.

In general, embodiments described herein relate to a non-transitory computer readable medium comprising computer readable program code. The computer readable code, which when executed by a computer processor, enables the computer processor to perform a method for performing a migration. The method includes identifying relationships between applications and generating, based on the relationships, a relationship matrix. The method also identifies reduced use times for each of the applications. The method then organizes the applications based on the relationship matrix and identified reduced use times and performs the migration based on the organizing of the applications.

In general, embodiments described herein relate to a system which includes at least two devices and a migrator. The migrator includes at least one processor, a storage device, and a memory. The memory includes instructions, which when executed by the processor perform a method for performing a migration of a plurality of applications between a first environment and at least a second environment. The method includes identifying relationships between applications and generating, based on the relationships, a relationship matrix. The method also identifies reduced use times for each of the applications. The method then organizes the applications based on the relationship matrix and identified reduced use times and performs the migration based on the organizing of the applications.

Other aspects of the embodiments disclosed herein will be apparent from the following description and the appended claims.

BRIEF DESCRIPTION OF DRAWINGS

Certain embodiments of the invention will be described with reference to the accompanying drawings. However, the accompanying drawings illustrate only certain aspects or implementations of the invention by way of example and are not meant to limit the scope of the claims.

FIG. 1A shows a diagram of a system in accordance with one or more embodiments of the invention.

FIG. 1B shows a diagram of a migrator in accordance with one or more embodiments of the invention.

FIG. 1C shows a diagram of an information processing device in accordance with one or more embodiments of the invention.

FIG. 2 shows a flowchart of a method for migrating applications in accordance with one or more embodiments of the invention.

FIG. 3 shows a flowchart of a method for performing dynamic strategizing.

FIG. 4 shows a flowchart of a method to determine parent and child relationships for an application being migrated in accordance with one or more embodiments of the invention.

FIG. 5 shows an example of a relationship tree in accordance with one or more embodiments of the invention.

FIG. 6 shows a computing system in accordance with one or more embodiments of the invention.

DETAILED DESCRIPTION

In the below description, numerous details are set forth as examples of embodiments described herein. It will be understood by those skilled in the art, and having the benefit of this Detailed Description, that one or more embodiments of embodiments described herein may be practiced without these specific details and that numerous variations or modifications may be possible without departing from the scope of the embodiments described herein. Certain details known to those of ordinary skill in the art may be omitted to avoid obscuring the description.

In the below description of the figures, any component described with regard to a figure, in various embodiments described herein, may be equivalent to one or more like-named components described with regard to any other figure. For brevity, descriptions of these components will not be repeated with regard to each figure. Thus, each and every embodiment of the components of each figure is incorporated by reference and assumed to be optionally present within every other figure having one or more like-named components. Additionally, in accordance with various embodiments described herein, any description of the components of a figure is to be interpreted as an optional embodiment, which may be implemented in addition to, in conjunction with, or in place of the embodiments described with regard to a corresponding like-named component in any other figure.

Throughout the application, ordinal numbers (e.g., first, second, third, etc.) may be used as an adjective for an element (i.e., any noun in the application). The use of ordinal numbers is not to imply or create any particular ordering of the elements nor to limit any element to being only a single element unless expressly disclosed, such as by the use of the terms “before”, “after”, “single”, and other such terminology. Rather, the use of ordinal numbers is to distinguish between the elements. By way of an example, a first element is distinct from a second element, and the first element may encompass more than one element and succeed (or precede) the second element in an ordering of elements.

As used herein, the phrase operatively connected, or operative connection, means that there exists between elements/components/devices a direct or indirect connection that allows the elements to interact with one another in some way. For example, the phrase ‘operatively connected’ may refer to any direct (e.g., wired directly between two devices or components) or indirect (e.g., wired and/or wireless connections between any number of devices or components connecting the operatively connected devices) connection. Thus, any path through which information may travel may be considered an operative connection.

In general, embodiments described herein relate to methods, systems, and non-transitory computer readable mediums storing instructions for creating and executing migration workflows to replicate or migrate data (collectively referred to herein as ‘migration’) from one device or set of devices to another device or set of devices (e.g., from one computing environment to another). In one or more embodiments, migrations involve obtaining relationship information with regards to the applications that will be migrated from one device to another device or set of devices. In one or more embodiments of the invention, the migrations also consider the best time, based on use and load times, to perform a migration of each application.

In one or more embodiments, relationship information for the applications being migrated is obtained. The applications are classified based on their relationships such as HAS-A (two or more applications have a correlated relationship with each other) and IS-A (two or more applications have a dependency relationship, such as being parent and/or a child application.) Based on these classifications, one or more embodiments of the invention generate a relationship matrix in order to assign priority to the migration of each individual application.

In one or more embodiments, the best time for migrating the applications is determined by a dynamic strategizer. The dynamic strategizer obtains application idle times, usage (peak and decreased), as well as the amount of time it takes the application to load after being stopped. Based on this information the dynamic strategizer can determine periods of time to perform a migration when it will be least disruptive to users or related systems. These determined periods of time, along with the relationship matrix, can then be used to perform the migration.

FIG. 1A shows a diagram of a system in accordance with one or more embodiments described herein. The system may include any number of source devices (100), and any number of target devices (104). The system may also include a migrator (102) operatively connected to the source devices (100) and to the target devices (104). Each of these components is described below.

In one or more embodiments, the source devices (100) and the target devices (104) may be computing devices. Such computing devices may be referred to as endpoints. In one or more embodiments, an endpoint is any computing device, collection of computing devices, portion of one or more computing devices, or any other logical grouping of computing resources. In one or more embodiments, the source devices (100) may collectively be referred to as a source environment. Similarly, in one or more embodiments, target devices (104) may collectively be referred to as a target environment. In one or more embodiments, a computing device is any device, portion of a device, or any set of devices capable of electronically processing instructions and may include, but is not limited to, any of the following: one or more processors (e.g. components that include integrated circuitry) (not shown), memory (e.g., random access memory (RAM)) (not shown), input and output device(s) (not shown), non-volatile storage hardware (e.g., solid-state drives (SSDs), hard disk drives (HDDs) (not shown)), one or more physical interfaces (e.g., network ports, storage ports) (not shown), any number of other hardware components (not shown) and/or any combination thereof.

Examples of computing devices include, but are not limited to, a server (e.g., a blade-server in a blade-server chassis, a rack server in a rack, etc.), a desktop computer, a mobile device (e.g., laptop computer, smart phone, personal digital assistant, tablet computer and/or any other mobile computing device), a storage device (e.g., a disk drive array, a fiber channel storage device, an Internet Small Computer Systems Interface (iSCSI) storage device, a tape storage device, a flash storage array, a network attached storage device, etc.), a network device (e.g., switch, router, multi-layer switch, etc.), a virtual machine, a virtualized computing environment, a logical container (e.g., for one or more applications), and/or any other type of computing device with the aforementioned requirements. In one or more embodiments, any or all of the aforementioned examples may be combined to create a system of such devices, which may collectively be referred to as a computing device. Other types of computing devices may be used without departing from the scope of the invention. In one or more embodiments, a set of computing devices (100) may form all or a portion of a data domain, all, or part of which may require being migrated (e.g., re-located, backed-up, etc.) from time to time (e.g., upon request and/or pursuant to a defined schedule). In one or more embodiments, a data domain is any set of computing devices (100) for which migration services are performed, such as, for example, data backup, disaster recovery, backup data deduplication, re-location to updated/newer computing devices, etc.

In one or more embodiments, the non-volatile storage (not shown) and/or memory (not shown) of a computing device or system of computing devices may be one or more data repositories for storing any number of data structures storing any amount of data (i.e., information). In one or more embodiments, a data repository is any type of storage unit and/or device (e.g., a file system, database, collection of tables, RAM, and/or any other storage mechanism or medium) for storing data. Further, the data repository may include multiple different storage units and/or devices. The multiple different storage units and/or devices may or may not be of the same type or located at the same physical location.

In one or more embodiments, any non-volatile storage (not shown) and/or memory (not shown) of a computing device or system of computing devices may be considered, in whole or in part, as non-transitory computer readable mediums storing software and/or firmware.

Such software and/or firmware may include instructions which, when executed by the one or more processors (not shown) or other hardware (e.g., circuitry) of a computing device and/or system of computing devices, cause the one or more processors and/or other hardware components to perform operations in accordance with one or more embodiments described herein.

The software instructions may be in the form of computer readable program code to perform methods of embodiments as described herein, and may, as an example, be stored, in whole or in part, temporarily or permanently, on a non-transitory computer readable medium such as a compact disc (CD), digital versatile disc (DVD), storage device, diskette, tape storage, flash storage, physical memory, or any other non-transitory computer readable medium.

In one or more embodiments, the system also includes a migrator (102). In one or more embodiments, the migrator (102) is operatively connected to both the source devices (100) and the target devices (104). A migrator (102) may be located within a source environment, within a target environment, or separate from and connected to both environments. In one or more embodiments, the migrator (102) is a computing device. In one or more embodiments, a computing device (100) is any device, portion of a device, or any set of devices capable of electronically processing instructions and may include, but is not limited to, any of the following: one or more processors (e.g. components that include integrated circuitry) (not shown), memory (e.g., random access memory (RAM)) (not shown), input and output device(s) (not shown), non-volatile storage hardware (e.g., SSDs, HDDs (not shown)), one or more physical interfaces (e.g., network ports, storage ports) (not shown), any number of other hardware components (not shown) and/or any combination thereof.

Examples of computing devices include, but are not limited to, a server (e.g., a blade-server in a blade-server chassis, a rack server in a rack, etc.), a desktop computer, a mobile device (e.g., laptop computer, smart phone, personal digital assistant, tablet computer and/or any other mobile computing device), a storage device (e.g., a disk drive array, a fiber channel storage device, an iSCSI storage device, a tape storage device, a flash storage array, a network attached storage device, etc.), a network device (e.g., switch, router, multi-layer switch, etc.), a virtual machine, a virtualized computing environment, a logical container (e.g., for one or more applications), and/or any other type of computing device with the aforementioned requirements. In one or more embodiments, any or all of the aforementioned examples may be combined to create a system of such devices, which may collectively be referred to as a computing device. Other types of computing devices may be used without departing from the scope of the invention.

In one or more embodiments, the non-volatile storage (not shown) and/or memory (not shown) of a computing device or system of computing devices may be one or more data repositories for storing any number of data structures storing any amount of data (i.e., information). In one or more embodiments, a data repository is any type of storage unit and/or device (e.g., a file system, database, collection of tables, RAM, and/or any other storage mechanism or medium) for storing data. Further, the data repository may include multiple different storage units and/or devices. The multiple different storage units and/or devices may or may not be of the same type or located at the same physical location.

In one or more embodiments, a computing device includes and/or is operatively connected to any number of storage volumes (not shown). In one or more embodiments, a volume is a logically accessible storage element of a computing system. A volume may be part of one or more disk drives, and may include, or not, any number of partitions. In one or more embodiments, a volume stores information relevant to the operation and/or accessible data of a computing device. In one or more embodiments, a volume may be all or part of any type of computing device storage (described above).

In one or more embodiments, any non-volatile storage (not shown) and/or memory (not shown) of a computing device or system of computing devices may be considered, in whole or in part, as non-transitory computer readable mediums storing software and/or firmware.

Such software and/or firmware may include instructions which, when executed by the one or more processors (not shown) or other hardware (e.g., circuitry) of a computing device and/or system of computing devices, cause the one or more processors and/or other hardware components to perform operations in accordance with one or more embodiments described herein.

The software instructions may be in the form of computer readable program code to perform methods of embodiments as described herein, and may, as an example, be stored, in whole or in part, temporarily or permanently, on a non-transitory computer readable medium such as a compact disc (CD), digital versatile disc (DVD), storage device, diskette, tape storage, flash storage, physical memory, or any other non-transitory computer readable medium.

The migrator (102), and components, therein are discussed further in the description of FIGS. 1B and 1C, below.

In one or more embodiments, the source devices (100), the migrator (102), and/or the target devices (104) are operatively connected via a network (not shown). A network may refer to an entire network or any portion thereof (e.g., a logical portion of the devices within a topology of devices). A network may include a datacenter network, a wide area network, a local area network, a wireless network, a cellular phone network, or any other suitable network that facilitates the exchange of information from one part of the network to another. A network may be located at a single physical location or be distributed at any number of physical sites. In one or more embodiments, a network may be coupled with or overlap, at least in part, with the Internet.

While FIG. 1A shows a configuration of components, other configurations may be used without departing from the scope of embodiments described herein. Accordingly, embodiments disclosed herein should not be limited to the configuration of components shown in FIG. 1A.

FIG. 1B shows a diagram of a migrator (102) in accordance with one or more embodiments described herein. The migrator (102) may include any number of components. As shown in FIG. 1B, the migrator (102) includes a migration request receiver (110), an endpoint information collector (EIC) (112), a pre-requisite checker (114), a host addition device (116), a migration analyzer (118), a migration knowledge database (120), a user input interface (122), a migration workflow presenter (124), a migration initiator (126), an application relationship mapper (128), a dynamic strategizer (130), and a maintenance planner (132). Each of these components is described below.

In one or more embodiments, a migrator (102) is a computing device, as discussed above in the description of FIG. 1A.

In one or more embodiments, the migrator (102) includes a migration request receiver (110). In one or more embodiments, a migration request receiver (110) is any hardware (e.g., circuitry), software, firmware, or any combination thereof that includes functionality to receive a request that all or any portion of a source environment (e.g., source devices (100) of FIG. 1A) be migrated to a target environment (e.g., target devices (104) of FIG. 1A). In one or more embodiments, such a migration request may be received via a user interface (not shown), may be received on a recurring basis as part of a planned migration scheme, may be received as part of a planned computing environment upgrade, etc. A migration request may be for any type of migration or combination of migration types. Examples of migration types include, but are not limited to: storage array to hyper-converged infrastructure (HCI); host server to host server, VM environment to HCI, storage array to storage array, hypervisors to hypervisors, host servers to storage array, on-premise computing devices to a cloud environment and vice versa, application servers to application servers (e.g., older Exchange server to either a newer on-premise Exchange server or to a cloud-based Exchange service.), different source to target endpoints that may be from vendors that are unique and different, backup of all or part of a data center environment, etc. One of ordinary skill in the art, having the benefit of this detailed disclosure will appreciate that any other type of migration may be requested without departing from the scope of embodiments described herein.

In one or more embodiments, the migrator (102) includes an Endpoint Information Collector (EIC) (112) operatively connected to the migration request receiver (110). In one or more embodiments, an EIC (112) is any hardware (e.g., circuitry), software, firmware, or any combination thereof that includes functionality to obtain endpoint information from source devices and target devices. In one or more embodiments, endpoint information is obtained in any manner capable of collecting data from or about computing devices.

Such endpoint information may include, but is not limited to: system types, license information, software versions, virtualization environment details, operating system information, virtual machine information, source and target device identification information, endpoint organization information (e.g., cluster membership), HCI details information, storage configuration information, storage array details (e.g., RAID level configuration information), disk information (e.g., disk type, disk layout, etc.), network configuration information, interface connection information, network speed information, network adapter information, network addresses, feature enablement information, endpoint system setting information (e.g., BIOS information), file system information, storage management initiative specification (SMIS) object information, protocol information, device type information, cache policy information, spare storage information, storage controller information, storage area network information, operating system information, file system information, application information and settings, process identifiers, common object model (COM) object information, etc. One having ordinary skill in the art will appreciate that any other type of information that could be associated with all or any portion of computing devices or with any portion thereof in a computing environment may be considered endpoint information without departing from the scope of embodiments described herein.

In one or more embodiments, the migrator (102) includes a pre-requisite checker (114) operatively connected to the EIC (112). In one or more embodiments, a pre-requisite checker (114) is any hardware (e.g., circuitry), software, firmware, or any combination thereof that includes functionality to obtain endpoint information from the EIC (112) and use the information to perform one or more pre-requisite checks.

In one or more embodiments, a pre-requisite check is an analysis of a target environment for a migration, relative to the source environment, to identify whether any inconsistencies may exist that would cause a requested migration to fail. For example, the pre-requisite checker (114) may determine if any storage characteristics, network configuration, computing device processor settings, etc. are different in the target environment relative to the source environment. In one or more embodiments, the pre-requisite checker includes functionality to assess each difference discovered during the pre-requisite check (which may be captured in pre-requisite check logs), and to take actions to mitigate the differences discovered. Such actions may be taken, for example, by using any application programming interface, command line interface, etc. that is capable of adjusting the configuration of target devices in the target environment.

In one or more embodiments, the migrator (102) includes a host addition device (116) operatively connected to the EIC (112). In one or more embodiments, a host addition device (116) is any hardware (e.g., circuitry), software, firmware, or any combination thereof that includes functionality to obtain endpoint information from the EIC (112) in response to a request to add a new endpoint (e.g., host server) to a source environment that is being migrated as part of a migration workflow, and to generate a new migration job for the new host and add it to a migration workflow. In one or more embodiments, when a new host is added to a source environment that is being migrated by a migration workflow, the host may be added to the migration workflow instead of having to wait until the migration workflow has been completed. In one or more embodiments, when a request to add a new host is received, the host addition device (116) invokes a job priority analyzer (not shown) to determine what action to take.

In one or more embodiments, the job priority analyzer determines the priority assigned to the migration jobs of the currently executing migration workflow, which may be assigned by the job priority analyzer at that time, and/or which may have been assigned to the migration jobs prior to the new host addition. In one or more embodiments, the priority assigned to migration jobs of a migration workflow determines the order that the jobs are placed within a queue that determines the order of execution of the migration jobs.

In one or more embodiments, during execution of a migration workflow, migration jobs for specific applications or devices may be assigned a priority. As such, a migration workflow may be organized such that higher priority migration jobs occur before lower priority migration jobs. For example, a set of storage volumes that are part of a consistency group and have never been backed up may be assigned a high priority; a set of storage volumes that have been backed up a small number of times may be assigned a medium priority; and a set of storage volumes that have been backed up many times and are scheduled to be backed up on a frequent basis may be assigned a low priority.

In one or more embodiments, the job priority analyzer of the host addition device (116) determines the priority assigned to a currently executing migration job. In one or more embodiments, if the priority is higher than a priority threshold, then the new host addition request is not serviced until the current migration job is completed. For example, if the threshold is above low priority, then any medium or high priority job will be completed. In one or more embodiments, if the priority of the currently executing migration job is below the threshold, then the migration job is paused. For example, if the threshold is above a low priority, then a migration job assigned a low priority is paused.

In one or more embodiments, after completion of a migration job above a priority threshold, or after pausing a migration job below a priority threshold, the host addition device (116) services the new host addition request. In one or more embodiments, servicing the new host addition request includes using the EIC (112) to gather endpoint information about the new host, to create one or more new consistency group(s) for the new host, to create a new migration job, and to assign a priority to the new migration job. In one or more embodiments, the host addition device (116) includes functionality to place the new migration job into the queue of remaining migration jobs of a migration workflow based on the assigned priority. As such, in one or more embodiments, the new migration job is integrated into the existing and currently executing migration workflow before the migration workflow completes.

In one or more embodiments, each of the EIC (112), the pre-requisite checker (114), and the host addition device (116) of the migrator (102) are operatively connected to a migration analyzer (118). In one or more embodiments, a migration analyzer (118) is any hardware (e.g., circuitry), software, firmware, or any combination thereof that includes functionality to obtain endpoint information from the EIC (112) and to analyze the information to develop a migration workflow that includes any number of mini-workflows to perform a migration of source endpoints to target endpoints as part of a requested migration. In one or more embodiments, the migration analyzer includes functionality to classify and filter endpoint information and apply artificial intelligence via machine learning techniques (e.g., multi-label correlation algorithms) to the endpoint information to associate portions of the endpoint information with mini-workflow templates available in a migration knowledge database (discussed below) as part of building a migration workflow.

In one or more embodiments, the migration analyzer (118) is operatively connected to a migration knowledge database (120). In one or more embodiments, a migration knowledge database (120) is a data storage of any type that includes functionality to store migration workflows as sets of discrete mini-workflows that may be labeled based on the characteristics of endpoint information that may be migrated using the mini-workflow. In one or more embodiments, the migration knowledge database (120) includes a starting set of known mini-workflows for migrating a variety of standard endpoint types, as well as all, or any, portion of previously executed workflow templates, which are stored in the migration knowledge database as migration workflows are executed, thereby expanding the migration knowledge database to encompass migrations of new endpoints as they are encountered. As such, future migrations may become more efficient as the database grows to have more mini-workflow templates that encompass an increasingly large set of possible-endpoint migration scenarios.

In one or more embodiments, when a similar migration request is received, the stored workflow templates will be reused instead of creating an entirely new workflow. In one or more embodiments, the mini-workflows of the migration knowledge database (120) may be combined and/or re-combined in any way to form part of a new migration workflow, rather than only being used for the same type of overall migration workflow, for which the mini-workflow was originally used. For example, a new migration request may cause the migration analyzer to create a new migration workflow that uses certain mini-workflows from one previously executed migration workflow, and other mini-workflows from other previously executed migration workflows, to build a new migration workflow for the new request using the existing mini-workflows, instead of having to re-create each mini-workflow and/or an overall migration workflow.

In one or more embodiments, the migration analyzer (118) is also operatively connected to a user input interface (122). In one or more embodiments, a user input interface (122) is any hardware (e.g., circuitry), software, firmware, or any combination thereof that includes functionality to receive or otherwise obtain any user input required to generate a complete migration workflow. In one or more embodiments, if a migration analyzer identifies a certain mini-workflow that meets a minimum threshold as acceptable to use as part of a migration workflow to migrate a portion of the endpoint information of source endpoints, additional user input may still be required to add to the mini-workflow as additional information to facilitate the migration. In one or more embodiments, such additional information may be used to augment the selected mini-workflow, and such an augmented mini-workflow may be added as a new mini-workflow to the migration knowledge database (120) to be used in future migration workflow building, which may reduce the need for at least some future user input during the building of a migration workflow in response to a migration request. In one or more embodiments, user input may be received via the user input interface (122) via any method of receiving information. For example, a user may be presented with a graphical or command line interface that prompts a user to enter requested information.

In one or more embodiments, the migration analyzer (118) is operatively connected to a migration workflow presenter (124). In one or more embodiments, a migration workflow presenter (124) is any hardware (e.g., circuitry), software, firmware, or any combination thereof that includes functionality to present a migration workflow for approval to any one or more approving entities (not shown). In one or more embodiments, once a migration workflow has been developed for a requested migration, the entire migration workflow may be presented to any number of entities that are responsible for the migration. For example, stakeholders such as data center administrators, network administrators, system administrators, decision makers for an entity in control of a data center, etc. may each have to approve a migration workflow before a migration may take place. Accordingly, a migration workflow presenter (124) may include functionality to present the proposed migration workflow to such entities.

In one or more embodiments, the migration workflow presenter (124) is operatively connected to a migration initiator (126). In one or more embodiments, a migration initiator (126) is any hardware (e.g., circuitry), software, firmware, or any combination thereof that includes functionality to initiate a migration once the migration has been approved after presentation by a migration workflow presenter (124). In one or more embodiments, initiating a migration includes beginning execution of migration workflow jobs of a migration workflow in an order determined by a queue of migration jobs that is created based on the relative priority of the migration jobs. In one or more embodiments, a new host addition via a new host addition device (116) may pause a migration workflow to add a new migration job for a new consistency group for the new host as discussed above.

In one or more embodiments of the invention, the migrator (102) includes an application relationship mapper (128). The application relationship mapper (128) determines the relationship between individual applications that are to be migrated. Based on this determination the Migration Analyzer (118) can then determine a priority for each application.

In one or more embodiments, the Migration Analyzer (118) determines the priority assigned to the applications based on the based on the relationship matrix developed by the application relationship mapper (128). In one or more embodiments, the priority assigned to migration jobs of individual applications determines the order that the jobs are placed within a queue that determines the order of execution of the migration jobs. The method of assigning the priority and determining the order of execution will be discussed in more detail with regards to FIGS. 2 and 3 below. In one or more embodiments, a migration job requires that a parent application must be migrated and re-started successfully before a child application is migrated. In still other one or more embodiments of the invention the job priority analyzer assigns applications with a HAS-A relationship a higher priority than those associated with an IS-A relationship

In one or more embodiments of the invention, the application relationship mapper (128) determines the relationships between an application to be migrated and other applications. The relationship in one or more embodiments of the invention, can be determined by port mapping such as looking at port mapping meta-data or the actual system internal traffic on various ports. By analyzing whether traffic on a specific port is outgoing or incoming, the relationship mapper or other equivalent structure can determine when the application is the parent node, and which is the child node. The independent application in a system would be a parent and the dependent application would be the child. The child or dependent application would be considered to have an IS-A relationship with the parent.

In one or more embodiments of the invention, the application relationship mapper, finds multiple applications with the same system access to the same data paths and location. In this case the application relationship mapper, determines that the two applications have a HAS-A relationship. This can be determined by the application relationship mapper, by looking at meta-data for the particular data path and or a registration ID that is common to at least two applications. Other means for identifying both a HAS-A relationship and/or IS-A relationship can be used, without departing from the invention.

In one or more embodiments of the invention, the migrator (102) includes a dynamic strategizer (130). The dynamic strategizer (130) analyzes data on the applications and/or devices to determine the best strategy for migrating each application. In accordance with one or more embodiments of the invention, the dynamic strategizer obtains log data on each of the applications that are to be migrated and determines their idle times and/or reduced usage times, peak usage times, and loading time. Based on these times the dynamic strategizer (130) in concert with the maintenance planner (132), which will be described next, are able to plan the best times to perform the migration.

In one or more embodiments of the invention, the maintenance planner (132), places an application in a maintenance mode when performing a migration and alerts users or other concerned parties such as administrators that the application will be down and for how long. Once an application and its dependencies (as determined by application relationship mapper (128)) is migrated, the maintenance planner (132) sends and maintenance mode end signal, and the application is taken out of maintenance mode and becomes available for use by the user again.

While FIG. 1B shows a configuration of components, other configurations may be used without departing from the scope of embodiments described herein. For example, although FIG. 1B shows all components as part of the same device, any of the components may be grouped in sets of one or more components which may exist and execute as part of any number of separate and operatively connected devices. Accordingly, embodiments disclosed herein should not be limited to the configuration of components shown in FIG. 1B.

FIG. 1C shows a diagram of a system that performs the methods in one or more embodiments of the invention. The system includes source device (100) and an application relationship mapper (128) in accordance with one or more embodiments described herein. For simplicity, the system shown in FIG. 1C only shows a subset of the system (e.g., the systems shown in FIGS. 1 and 2 ).

As shown in FIG. 1C, the source device (100) includes a one or more hosts (e.g., 140, 142) as well as a plurality of virtual storage devices (e.g., 144A, 144N). In one or more embodiments of the invention, the target device (e.g., 104, FIG. 1A) has a similar form and structure to that of the source device (100). In one or more embodiments of the invention, the target device (e.g., 104, FIG. 1A) and source device (e.g., 100) may be part of the same physical device. In other embodiments, they may be separate devices that are connected either by a wired or wireless connection. One or more of the devices may also be an Internet or cloud based virtual device. Other configurations of the source device (100) and target device (104) can be used without departing from the invention.

In one or more embodiments of the invention, the production hosts (e.g., 140, 142), host one or more applications. In one or more embodiments of the invention, the application(s) perform computer implemented services for clients (not shown). Performing the computer implemented services may include performing operations on asset data that is stored in the virtual storage devices (e.g., 144). The operations may include creating elements of assets, moving elements of assets, modifying elements of assets, deleting elements of assets, and other and/or additional operations on asset data without departing from the invention. The application(s) may include functionality for performing the aforementioned operations on the asset data in the production hosts (e.g., 140, 142). The application(s) may be, for example, instances of databases, email servers, and/or other applications. The production hosts (e.g., 140, 142) may host other types of applications without departing from the invention, including hosting the application relationship mapper (128).

In one or more of embodiments of the invention, the applications are implemented as computer instructions, e.g., computer code, stored on a persistent storage or virtual storage devices (144), that when executed by a processor(s) of the production hosts (e.g., 140, 142) cause the production hosts (e.g., 140, 142) to provide the functionality of the application(s) described throughout this application.

The production hosts (e.g., 140, 142) may include physical storage or logical storage (144, as shown in FIG. 1C). One or more of the production hosts (e.g., 140, 142), may be externally located on a cloud or other external location. The logical storage devices (144) may utilize any quantity of hardware storage resources of any number of computing devices for storing data. For example, the persistent storage may utilize portions of any combination of hard disk drives, solid state disk drives, tape drives, and/or any other physical storage medium of any number of computing devices.

In one or more embodiments of the invention, the production hosts (e.g., 140, 142) may host virtual machines that host the above-discussed applications. Each of the production hosts (e.g., 140, 142) may host any number of VMs that, in turn, host any number of applications. Each of the production hosts (e.g., 140, 142) may host or be operatively connected to a plurality of virtual storage devices (e.g., 144A, 144N). Alternatively, in one or more embodiments of the invention the virtual storage devices (144) can instead be physical storage devices such as hard disk drive, solid disk drive, tape drives, and or other physical storage mediums of any number of computing devices.

In one or more embodiments of the invention, the production hosts (e.g., 140, 142) may be implemented as computing devices (e.g., 600, FIG. 6 ). A computing device may be, for example, a mobile phone, a tablet computer, a laptop computer, a desktop computer, a server, a distributed computing system, or a cloud resource. The computing device may include one or more processors, memory (e.g., random access memory), and persistent storage (e.g., disk drives, solid-state drives, etc.). The computing device may include instructions, stored on the persistent storage, that when executed by the processor(s) of the computing device, cause the computing device to perform the functionality of the production hosts (e.g., 140, 142) described throughout this application.

In one or more embodiments of the invention the system as shown in FIG. 1C includes an application relationship mapper (128) for determining the relationship of the various applications on one or more hosts (e.g., 140, 142) that are to be migrated in accordance with the method of the invention which will be described in more detail with regards to FIGS. 2 and 3 .

In one or more embodiments of the invention, the application relationship mapper (128) may be implemented as computing devices (e.g., 600, FIG. 6 ). A computing device may be, for example, a mobile phone, a tablet computer, a laptop computer, a desktop computer, a server, a distributed computing system, or a cloud resource. The computing device may include one or more processors, memory (e.g., random access memory), and persistent storage (e.g., disk drives, solid-state drives, etc.). The computing device may include instructions, stored on the persistent storage, that when executed by the processor(s) of the computing device, cause the computing device to perform the functionality of the application relationship mapper (128) described throughout this application.

In one or more embodiments of the invention, the system as shown in FIG. 1C includes the dynamic strategizer (130), and maintenance planner (132). As discussed above with regards to FIGS. 1B and 1 n more detail with regards to the methods of FIGS. 2 and 3 , the dynamic strategizer (130) and maintenance planner (132) analyze each applications use times and load times to determine in concert with the application relationship mapper (128) when the best time to migrate an application and its dependencies. In one or more embodiments of the invention the maintenance planner (132) also alerts a user, administrator, or other concerned entity that the application will be unavailable for a set period of time that includes the time to migrate and load the application.

In one or more embodiments of the invention, the dynamic strategizer (130) and maintenance planner (132) may be implemented as computing devices (e.g., 600, FIG. 6 ). A computing device may be, for example, a mobile phone, a tablet computer, a laptop computer, a desktop computer, a server, a distributed computing system, or a cloud resource. The computing device may include one or more processors, memory (e.g., random access memory), and persistent storage (e.g., disk drives, solid-state drives, etc.). The computing device may include instructions, stored on the persistent storage, that when executed by the processor(s) of the computing device, cause the computing device to perform the functionality of the application relationship mapper (128) described throughout this application.

While FIG. 1C shows a configuration of components, other configurations may be used without departing from the scope of embodiments described herein. For example, although FIG. 1C shows all components as part of two devices, any of the components may be grouped in sets of one or more components which may exist and execute as part of any number of separate and operatively connected devices. Accordingly, embodiments disclosed herein should not be limited to the configuration of components shown in FIG. 1C.

FIG. 2 shows a flowchart describing a method for migrating one or more applications from a first device to a second device in accordance with one or more embodiments disclosed herein.

While the various steps in the flowchart shown in FIG. 2 are presented and described sequentially, one of ordinary skill in the relevant art, having the benefit of this Detailed Description, will appreciate that some or all of the steps may be executed in different orders, that some or all of the steps may be combined or omitted, and/or that some or all of the steps may be executed in parallel.

As discussed above, FIG. 2 shows a flowchart of a method for migrating one or more applications, in accordance with one or more embodiments of the invention. The method may be performed by, for example, the migrator (102, FIG. 1B) and/or any other part of either the source device (100, FIG. 1 ) or target device (104, FIG. 1 ). Other components of the system illustrated in FIGS. 1A-1C may perform all, or a portion of the method of FIG. 2 without departing from the invention.

While FIG. 2 is illustrated as a series of steps, any of the steps may be omitted, performed in a different order, additional steps may be included, and/or any or all the steps may be performed in a parallel and/or partially overlapping manner without departing from the invention.

In step 200, a request is received to migrate any amount of a source device's applications and information to a target device or devices. In one or more embodiments, the migration request is received by a migrator.

In step 202, dynamic strategizing determines a priority and preferred times for migrating each application based on at least the application's reduced use times including idle times, as well as in one or more embodiments of the invention, the application's current level of usage. In one or more embodiments of the invention, the dynamic strategizing also includes taking in account loading time for the application to determine both the preferred time for migrating as well as accurately determine the amount of time the application will not be available during the migration. Dynamic strategizing will be discussed in more detail below, with regards to the method of FIG. 3 .

In step 204, the migrator identifies the relationship between the applications, as will be discussed in more detail below, with regards to the method of FIG. 4 . The migrator identifies if at least two applications have a relationship and if the relationship is a HAS-A or IS-A relationship.

As discussed above, this is done by having the application relationship mapper analyzing inter-process communications. The inter-process communication may include analyzing any one of shared memory segments, pipes, message queues, semaphore arrays and sockets. Other inter-process communications can be monitored as well. From this analysis and/or other processes, the specific port(s) that an application is running on are identified. The application relationship mapper can also identify shared pipes.

Based on the inter-process communications, ports, and shared pipes, the application relationship mapper can identify applications that are related to each other. Using the information gathered on the various communications, ports and pipes, the application relationship mapper can determine their relationship and identify if the relationship is an IS-A or HAS-A type relationship.

In step 206, the migrator uses this identification of the relationships between the at least two applications to produce a matrix for each application showing its relationship to other applications. The matrix can take the form of a table as shown in the exemplary table below:

TABLE 1 Application Relationship Applications DA1 HAS-A DA2, DA3, DA4 DA2 HAS-A DA1 DA3 HAS-A DA1 DA4 HAS-A; IS-A DA1, DA5; DA1, DA6 DA5 HAS-A DA4 DA6 Independent node DA7 HAS-A; IS-A DA8; DA4 DA8 HAS-A; IS-A DA7; DA4 DA9 IS-A DA5 DA10 IS-A DA5 DA11 IS-A DA9 DA12 IS-A DA7; DA4 DA13 IS-A DA6 DA14 HAS-A; IS-A DA15; DA13 DA15 HAS-A DA14

In Table 1, the relationships between fifteen different applications (DA1-DA15) are shown. The target application is listed in the first column. The type of relationship the target application has with other applications is listed in the second column (HAS-A: where two applications are working together, IS-A: where the child application is dependent on the parent application, and Independent: the application is independent of the other applications). The applications that the target application has the relationship listed in the second column with, is listed in the third column. More than one application can have the same type of relationship with the first application. The matrix produced in step 204 can take other forms such as database and in one or more embodiments of the invention, it can also be represented in the form of a relationship tree, which is discussed below with regards to the example in FIG. 5 .

Next in step 208, using the matrix or table generated in step 206, the method determines whether an application is a HAS-A application or IS-A application.

The method then proceeds to step 210, where the information determined in step 208 is then used along with the prioritization and use time determined by the dynamic strategizing in step 202 to organize the applications and determine when and/or what order to migrate the applications. In one or more embodiments of the invention, during the migration, a parent application is migrated prior to a child application. In one or more embodiments, the child is not migrated until the migrator confirms that the parent application has been completely migrated and successfully started. The method in one or more embodiments of the invention determines whether an application is a HAS-A application or IS-A application. Based on this determination the HAS-A applications are migrated first followed by the IS-A applications in step 210. In one or more embodiments of the invention, an application that has higher use/use times is migrated prior to an application that has more idle or lower use time. In one or more embodiments of the invention, the organization of the applications, can be updated when changes in usage are detected by the dynamic strategizer.

Next in step 212, the next (or first) application to be migrated is determined based on the organization determined in step 210. This application in step 214 is placed in a maintenance mode by the maintenance planner (e.g., 132, FIG. 1C). In one or more embodiments of the invention, based on the time for migration and the load time for the application and all its dependencies, at this time the maintenance planner can also notify users and/or administrators that the application will be unavailable and an estimate for how long.

Once the application is put in a maintenance mode in step 214, the application is migrated in step 216 and once the migration is completed the method proceeds to step 218.

In step 218 the application is loaded, and the maintenance planner then sends a maintenance end signal or similar signal, taking the application out of the maintenance mode. In one or more embodiments of the invention, the application is left in maintenance mode, until all of its dependencies are also migrated and successfully loaded. An optional notification signal can be sent to users, administrators, and other concerned parties that the application is available for use once more. Alternatively in one or more embodiments of the invention, all applications can be kept in maintenance mode until all applications successfully migrated and are loaded.

The method then proceeds to step 220. If all the applications have been migrated, then the method may end after step 220, however, if applications still remain, the method then returns to step 212, and the next application is migrated.

FIG. 3 shows a flowchart describing a method for performing dynamic strategizing in accordance with one or more embodiments disclosed herein.

While the various steps in the flowchart shown in FIG. 3 are presented and described sequentially, one of ordinary skill in the relevant art, having the benefit of this Detailed Description, will appreciate that some or all of the steps may be executed in different orders, that some or all of the steps may be combined or omitted, and/or that some or all of the steps may be executed in parallel.

As discussed above, FIG. 3 shows a flowchart of a method for performing dynamic strategizing to determine a preferred time(s) to migrate an application and its dependencies based on reduced use times in accordance with one or more embodiments of the invention. This method may be performed on its own or as part of step 202 of the method of FIG. 2 . The method may be performed by, for example, the dynamic strategizer (e.g., 130, FIG. 1C) and/or any other part of either the source device (e.g., 100, FIG. 1 ) or target device (e.g., 104, FIG. 1 ). Other components of the system illustrated in FIGS. 1A-1C may perform all, or a portion of the method of FIG. 3 without departing from the invention.

While FIG. 3 is illustrated as a series of steps, any of the steps may be omitted, performed in a different order, additional steps may be included, and/or any or all the steps may be performed in a parallel and/or partially overlapping manner without departing from the invention.

In step 300, application's usage history is obtained for an application to be migrated. In one or more embodiments of the invention the method can include obtaining usage history from system logs for the application. The usage history can include such things as idle times, decrease usage, peak usage, as well as load times. In one or more embodiments of the invention current usage can also be obtained from logs or by performing a function to obtain current system tasks. For example, a “tasklist” command can be used, and from the resulting data CPU time for each application can be obtained to determine the amount of resource usage the application is currently using. Any other information useful for determining a preferred time(s) to migrate the application can also be obtained.

Once the usage history is obtained and any other related information, the usage history is parsed in step 302. And idle times and/or reduced use times are determined in step 304.

The method then proceeds to Step 306, where a priority or ideal time for migrating is determined based on current usage, idle and/or reduced use times. This priority can then be used in step 210 to organize the applications and determine the order for migrating.

Once step 306 is complete the method may end.

FIG. 4 shows a flowchart describing a method for determining the relationship between at least two applications in accordance with one or more embodiments disclosed herein.

While the various steps in the flowchart shown in FIG. 4 are presented and described sequentially, one of ordinary skill in the relevant art, having the benefit of this Detailed Description, will appreciate that some or all of the steps may be executed in different orders, that some or all of the steps may be combined or omitted, and/or that some or all of the steps may be executed in parallel.

As discussed above, FIG. 4 shows a flowchart of a method for determining the relationship between at least two applications, in accordance with one or more embodiments of the invention. This method may be performed on its own or as part of step 204 of the method of FIG. 2 . The method may be performed by, for example, the application relationship mapper (e.g., 128, FIG. 1C) and/or any other part of either the source device (e.g., 100, FIG. 1 ) or target device (e.g., 104, FIG. 1 ). Other components of the system illustrated in FIGS. 1A-1C may perform all, or a portion of the method of FIG. 4 without departing from the invention.

While FIG. 4 is illustrated as a series of steps, any of the steps may be omitted, performed in a different order, additional steps may be included, and/or any or all the steps may be performed in a parallel and/or partially overlapping manner without departing from the invention.

In step 400, for each application that is to be migrated, the method fetches the application identification (ID). This may be an ID given to an application by the migrator, a developer, or alternatively an ID that the system uses to identify the specific application.

Once the ID is obtained, then the method in step 402 obtains the port number(s) used by the application. step 402 can be performed by the application relationship mapper (e.g., 128, FIG. 1C), as described in more detail above. Other components of the migrator or the production hosts, alternatively, can perform step 402 without departing from the invention. The method then identifies all the applications using a particular port(s) in step 404 and determines which applications are related in step 406.

Based on the determination made in step 406, and specifics of the communications between two applications, the migrator then in step 408 determines if a current application is a parent or child for each related application. That information can then be used in step 206 of the method of FIG. 2 .

Once step 408 is complete the method may end. The method shown in FIG. 4 may be repeated for each application that is to be migrated.

Example

The following example is not intended to limit the scope of the invention.

FIG. 5 shows an example of a relationship tree (500) in order to better described the relationships between multiple applications and the order, according to the methods of FIGS. 2 and 3 , that applications in an exemplary source device (e.g., 100, FIG. 1A), in accordance with one or more embodiments of the invention, are migrated. While the example is shown as a relationship tree for easier understanding, other methods of organizing the applications can be used such as a table, and/or relationship matrix. The tree includes ten applications (510-540) with either a HAS-A, IS-A, or both relationships with other applications. More or less applications can be mapped in this manner and the number of applications is only dependent on the number of applications that the migration described in the method of FIGS. 3 and 4 is specified to be performed as specified by either a user, administrator, or other components of the migrator (e.g., 102, FIG. 1B).

The first application (510) has three HAS-A relationships, one with the second application (512), one with the third application (514) and one with the fourth application (520). The first application (510) also has an IS-A relationship with the fourth application (520). According the first application (510) and the fourth application (520) has a parent-child relationship. The fourth application (520) additionally has a HAS-A relationship with the fifth application (524) and IS-A relationships with the sixth (522), seventh (530), and eighth application (532). The seventh and eighth applications have an HAS-A relationship and the seventh application (530) also have a HAS-A relationship with the ninth application (534) and an IS-A relationship with the tenth application (540).

When performing the migration, as described in more detail with regards to FIGS. 2-4 , the application relationship mapper (e.g., 128, FIG. 1C) determines the above relationships. The dynamic strategizer (e.g., 130, FIG. 1C) then determines priorities for the applications based on current use times and historical use times as well as idle times. The migrator (e.g., 102, FIG. 1A) then migrates the applications, in accordance with one or more embodiments of the invention. Applications 8, 9, and 10 can be migrated first based on their relationships. If Application 9 is determined to have high usage compared to Application 8, then Application 9 may be migrated before application 8, to insure less down time. Alternatively, Applications 8 and 10 may be migrated first, while waiting for a time with Application 9 is being used less, either historically or according to real time analysis by the dynamic strategizer.

Other orders of migrating can be considered in accordance with one or more embodiments of the invention based on criteria specified by a user or administrator as well as other components of the migrator (e.g., 102 of FIG. 1B) in addition to the order specified in the methods of FIGS. 2-4 . FIG. 5 is intended as an example only.

End Example

As discussed above, embodiments of the invention may be implemented using computing devices. FIG. 6 shows a diagram of a computing device in accordance with one or more embodiments of the invention. The computing device (600) may include one or more processors (602), non-persistent storage (604) (e.g., volatile memory, such as random access memory (RAM), cache memory), persistent storage (606) (e.g., a hard disk, an optical drive such as a compact disk (CD) drive or digital versatile disk (DVD) drive, a flash memory, etc.), a communication interface (612) (e.g., Bluetooth interface, infrared interface, network interface, optical interface, etc.), input devices (610), output devices (608), and numerous other elements (not shown) and functionalities. Each of these components is described below.

In one embodiment of the invention, the processor(s) (602) may be an integrated circuit for processing instructions. For example, the processor(s) may be one or more cores or micro-cores of a processor. The computing device (600) may also include one or more input devices (610), such as a touchscreen, keyboard, mouse, microphone, touchpad, electronic pen, or any other type of input device. Further, the communication interface (612) may include an integrated circuit for connecting the computing device (600) to a network (not shown) (e.g., a local area network (LAN), a wide area network (WAN) such as the Internet, mobile network, or any other type of network) and/or to another device, such as another computing device.

In one embodiment of the invention, the computing device (600) may include one or more output devices (608), such as a screen (e.g., a liquid crystal display (LCD), a plasma display, touchscreen, cathode ray tube (CRT) monitor, projector, or other display device), a printer, external storage, or any other output device. One or more of the output devices may be the same or different from the input device(s). The input and output device(s) may be locally or remotely connected to the computer processor(s) (602), non-persistent storage (604), and persistent storage (606). Many diverse types of computing devices exist, and the aforementioned input and output device(s) may take other forms.

In general, embodiments described above relate to methods, systems, and non-transitory computer readable mediums storing instructions for creating and executing migration workflows to replicate or migrate data from one device or set of devices to another device or set of devices (e.g., from one computing environment to another). In one or more embodiments, migrations involve obtaining relationship information with regards to the applications that will be migrated from one device to another device or set of devices. The migrations are performed in such a way to minimize inconvenience to the end users, by having the migration take place at a time when the application has reduced usage or idle time.

The methods, systems, and instructions, described above, during a migration, assign a priority to each application to be migrated based on its relationships with other applications and the device usage and load times. The applications are classified based on their relationships such as HAS-A (two or more applications have a correlated relationship with each other) and IS-A (two or more applications have a dependency relationship, such as being parent and child applications.) Based on these classifications, one or more embodiments of the invention generate a relationship matrix in order to assign priority to the migration of each individual application. The applications are then migrated based on the matrix and best migration times based on usage.

This approach attempts to prevent an application being migrated without an application of which it is dependent on. By performing the above-described methods, systems, and instructions, breaking of dependency between applications during migration can be minimized and migration failure due to device failure can be minimized. The method, systems, and instruction described above, attempt to assure that the migration will be successful with minimal interruption to the user.

The problems discussed above should be understood as being examples of problems solved by embodiments of the invention and the invention should not be limited to solving the same/similar problems. The disclosed invention is broadly applicable to address a range of problems beyond those discussed herein.

While embodiments described herein have been described with respect to a limited number of embodiments, those skilled in the art, having the benefit of this Detailed Description, will appreciate that other embodiments can be devised which do not depart from the scope of embodiments as disclosed herein. Accordingly, the scope of embodiments described herein should be limited only by the attached claims. 

What is claimed is:
 1. A method for performing a migration, the method comprising: identifying relationships between applications; generating, based on the relationships, a relationship matrix; identifying reduced use times for each of the applications; organizing the applications based on the relationship matrix and identified reduced use times; and performing the migration based on the organizing of the applications.
 2. The method of claim 1, wherein identifying the reduced use times for each of the applications comprises receiving and parsing the applications' usage history.
 3. The method of claim 1, wherein identifying the relationships between applications comprises determining if an application has a HAS-A relationship with another application.
 4. The method of claim 1, wherein identifying the relationships between applications comprises determining if an application has an IS-A relationship with another application.
 5. The method of claim 1, wherein the relationship matrix specifies at least one IS-A relationship and at least one HAS-A relationship.
 6. The method of claim 1, wherein the organizing the applications comprises ordering the applications to be migrated during an idle time or during a period when the application's use is lower.
 7. The method of claim 1, wherein the performing the migration further comprises placing the application in a maintenance mode prior to an application being migrated.
 8. A non-transitory computer readable medium comprising computer readable program code, which when executed by a computer processor enables the computer processor to perform a method for performing a migration, the method comprising: identifying relationships between applications; generating, based on the relationships, a relationship matrix; identifying reduced use times for each of the applications; organizing the applications based on the relationship matrix and identified reduced use times; and performing the migration based on the organizing of the applications.
 9. The non-transitory computer readable medium of claim 8, wherein identifying the reduced use times for each of the applications comprises receiving and parsing the applications' usage history.
 10. The non-transitory computer readable medium of claim 8, wherein identifying the relationships between applications comprises determining if an application has a HAS-A relationship with another application.
 11. The non-transitory computer readable medium of claim 8, wherein identifying the relationships between applications comprises determining if an application has an IS-A relationship with another application.
 12. The non-transitory computer readable medium of claim 8, wherein the relationship matrix specifies at least one IS-A relationship and at least one HAS-A relationship.
 13. The non-transitory computer readable medium of claim 8, wherein the organizing the applications comprises ordering the applications to be migrated during an idle time or during a period when the application's use is lower.
 14. The non-transitory computer readable medium of claim 8, wherein the performing the migration further comprises placing the application in a maintenance mode prior to an application being migrated.
 15. A system comprising: at least two devices; and a migrator which comprises: at least one processor; a storage device; and at least one memory that includes instructions, which when executed by the processor, perform a method for performing a migration of a plurality of applications between a first device and at least a second device of the at least two devices, the method comprising: identifying relationships between applications; generating, based on the relationships, a relationship matrix; identifying reduced use times for each of the applications; organizing the applications based on the relationship matrix and identified reduced use times; and performing the migration based on the organizing of the applications.
 16. The system of claim 15, wherein identifying the reduced use times for each of the applications comprises receiving and parsing the applications' usage history.
 17. The system of claim 15, wherein identifying the relationships between applications comprises determining if an application has a HAS-A relationship with another application.
 18. The system of claim 15, wherein the relationship matrix specifies at least one IS-A relationship and at least one HAS-A relationship.
 19. The system of claim 15, wherein the organizing the applications comprises ordering the applications to be migrated during an idle time or during a period when the application's use is lower.
 20. The system of claim 15, wherein the performing the migration further comprises placing the application in a maintenance mode prior to an application being migrated. 